Post-quantum cryptography
CRYPTOGRAPHY THAT IS SECURE AGAINST QUANTUM COMPUTERS
PQCrypto; PQcrypto; Pqcrypto; Post-quantum; Post-Quantum; Post-Quantum Cryptography; Post quantum cryptography; Post Quantum Cryptography; Post quantum; Post Quantum; Quantum Safe Cryptography; Quantum Resistant Cryptography; Post-quantum encryption; Algorithms for post-quantum cryptography; Quantum resistant cryptography; Quantum-resistant cryptography; Quantum safe cryptography; Quantum-safe cryptography; Quantum proof cryptography; Quantum-proof cryptography; Draft:Delaram Kahrobaei
In cryptography, post-quantum cryptography (sometimes referred to as quantum-proof, quantum-safe or quantum-resistant) refers to cryptographic algorithms (usually public-key algorithms) that are thought to be secure against a cryptanalytic attack by a quantum computer. The problem with currently popular algorithms is that their security relies on one of three hard mathematical problems: the integer factorization problem, the discrete logarithm problem or the elliptic-curve discrete logarithm problem.